Polynomials over structured grids

نویسندگان

چکیده

Abstract We study multivariate polynomials over ‘structured’ grids. Firstly, we propose an interpretation as to what it means for a finite subset of field be structured; do so by numerical parameter, the nullity. then extend several results – notably, Combinatorial Nullstellensatz and Coefficient Theorem structured The main point is that structure grid allows degree constraints on relaxed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Decoding and Testing of Polynomials over Grids

The well-known DeMillo-Lipton-Schwartz-Zippel lemma says that n-variate polynomials of total degree at most d over grids, i.e. sets of the form A1×A2×· · ·×An, form error-correcting codes (of distance at least 2−d provided mini{|Ai|} ≥ 2). In this work we explore their local decodability and local testability. While these aspects have been studied extensively when A1 = · · · = An = Fq are the s...

متن کامل

11 Composite Overset Structured Grids

The use of composite overset structured grids is an effective means of dealing with a wide variety of flow problems that spans virtually all engineering disciplines. Numerous examples involving steady and unsteady three-dimensional viscous flow for aerospace applications exist in the literature. The literature also chronicles a host of applications of the approach in areas as diverse as biomedi...

متن کامل

Chebyshev polynomials over finite fields and reversibility of -automata on square grids

Using number theory on function fields and algebraic number fields we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three.

متن کامل

Block-structured grids for Eulerian gyrokinetic simulations

In order to predict the turbulent transport in magnetic fusion experiments, global (i.e., full-torus) gyrokinetic simulations are often carried out. In this context, one frequently encounters situations in which the plasma temperature varies by large factors across the radial simulation domain. In grid-based Eulerian codes, this enforces the use of a very large number of grid points in the two-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability & Computing

سال: 2022

ISSN: ['0963-5483', '1469-2163']

DOI: https://doi.org/10.1017/s0963548322000232